1676A - Lucky - CodeForces Solution

implementation *800

Please click on ads to support us..

Python Code: 

n=int(input())
for i in range(n):
    m=input()
    li=list(map(int,m))
    if sum(li[:3])==sum(li[3:]):
        print("YES")
    else:
        print("NO")

C++ Code: 

#include<iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        int x,sum=0,sum1=0;
        cin>>x;
        for(int i=1;i<=3;i++)
        {
            int rem=x%10;
            x=x/10;
            sum=sum+rem;
        }
        for(int i=6;i>3;i--)
        {
            int rem1=x%10;
            x=x/10;
            sum1=sum1+rem1;
        }
        if(sum==sum1)
        {
            cout<<"YES"<<endl;
        }
        else
        {
            cout<<"NO"<<endl;
        }
    }
}


Comments

Submit
0 Comments
More Questions

e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees